#include <stdio.h>
#include <stdlib.h>

typedef struct LNode{
	int data;
	struct LNode *next; /*指向链表下一个结点*/
}LNode,*LinkList;

/*倒序插入到链表当中*/
void CreateLinkListReverse(LinkList head,int n){ 
	int data;
	int i;
	LinkList p;
	for(i = 1; i <= n; ++i){
		scanf("%d",&data);
		p = (LinkList)malloc(sizeof(LNode));
		p->data = data;
		p->next = head->next;
		head->next = p;
	}
}

int main(){
	LinkList head = (LinkList)malloc(sizeof(LNode));
	head->next = NULL;
	CreateLinkList(head,10);
	return 0;
}